Local Sufficiency for Partial Strategyproofness∗
نویسندگان
چکیده
In (Mennle and Seuken, 2017), we have introduced partial strategyproofness, a new, relaxed notion of strategyproofness, to study the incentive properties of nonstrategyproof assignment mechanisms. In this paper, we present results pertaining to local sufficiency for partial strategyproofness: We show that, for any r P r0, 1s, r-local partial strategyproofness implies r2-partial strategyproofness, and we show that this is the tightest polynomial bound for which a guarantee can be proven. Our results unify the two prior local sufficiency results for strategyproofness (Carroll, 2012) and lexicographic dominance-strategyproofness (Cho, 2012).
منابع مشابه
Partial Strategyproofness: An Axiomatic Approach to Relaxing Strategyproofness for Assignment Mechanisms
We present partial strategyproofness, a new, relaxed notion of strategyproofness to study the incentive properties of non-strategyproof assignment mechanisms. Under partially strategyproof mechanisms, truthful reporting is a dominant strategy for agents who have sufficiently different valuations for different objects. A single numerical parameter, the degree of strategyproofness, controls the e...
متن کاملPartial Strategyproofness: An Axiomatic Approach to Relaxing Strategyproofness for Random Assignment Mechanisms
In this paper, we present a new relaxed notion of strategyproofness to study the incentive properties of non-strategyproof random assignment mechanisms. To this end, we first prove a new decomposition of full strategyproofness into three axioms: swap monotonicity, upper invariance, and lower invariance. By dropping the lower invariance axiom we obtain partially strategyproof mechanisms, which r...
متن کاملOnline Appendix for Partial Strategyproofness: Relaxing Strategy- proofness for the Random Assignment Problem∗
Proof. Since deterministic mechanisms are just special cases of random mechanisms, Theorem 1 applies: A deterministic mechanism f is strategyproof if and only if it is swap monotonic, upper invariant, and lower invariant. Thus, strategyproofness implies swap monotonicity (i.e., sufficiency in Proposition 5). For necessity, observe that swap monotonicity implies upper and lower invariance for de...
متن کاملHybrid Mechanisms: Trading Off Strategyproofness and Efficiency of Random Assignment Mechanisms
Severe impossibility results restrict the design of strategyproof random assignment mechanisms, and trade-offs are necessary when aiming for more demanding efficiency requirements, such as ordinal or rank efficiency. We introduce hybrid mechanisms, which are convex combinations of two component mechanisms. We give a set of conditions under which such hybrids facilitate a non-degenerate tradeoff...
متن کاملExact Solution for Nonlinear Local Fractional Partial Differential Equations
In this work, we extend the existing local fractional Sumudu decomposition method to solve the nonlinear local fractional partial differential equations. Then, we apply this new algorithm to resolve the nonlinear local fractional gas dynamics equation and nonlinear local fractional Klein-Gordon equation, so we get the desired non-differentiable exact solutions. The steps to solve the examples a...
متن کامل